Analysis of Secret Image Sharing using Shared Image
نویسندگان
چکیده
منابع مشابه
Secret Sharing using Image Hashing
This paper presents a cryptographic technique that encrypts secret information using a coding image by transforming the pixels of this image from the intensity domain to the characters domain using a hash function. In the proposed technique, the coding image will be used to encrypt the secret information at the sender and decrypt it at the receiver using the pixels whose intensity values are tr...
متن کاملThreshold Secret Image Sharing
A (k, n) threshold secret image sharing scheme, abbreviated as (k, n)-TSISS, splits a secret image into n shadow images in such a way that any k shadow images can be used to reconstruct the secret image exactly. In 2002, for (k, n)-TSISS, Thien and Lin reduced the size of each shadow image to 1 k of the original secret image. Their main technique is by adopting all coefficients of a (k − 1)-deg...
متن کاملSecret Image Sharing Using Pseudo-Random Sequence
We propose a new concept which is derived from the cryptography, the substitution of bits in the image and the visual cryptography method. Given some secret data and a set of cover images, in the proposed scheme the secret data is encrypted by the administrator, after that we select the random bit planes of the cover images using the pseudo-random sequence and modify the cover image based on th...
متن کاملSecret Image Sharing Using Multiwavelet Transform
This paper presents a new secret image sharing method using multiwavelet transform in a general framework with the associated preand post-filtering to achieve an efficient representation of secret images at a low bit rate. It adopts a set partitioning in hierarchical trees (SPIHT) codec to enhance compactness of the data for processing in an image-sharing scheme. Because multiple data channels ...
متن کاملOn Secret Multiple Image Sharing
In traditional secret sharing schemes for general access structures, a secret can be encoded into n sets of (shadow, key)’s which are distributed to n participants one by one. Only those participants belonging to a pre-defined qualified subset can recover the shared secret by using their (shadow, key)’s. The size of (shadow, key)’s may be different for different participants. This problem exist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/18926-0283